Face Numbers of 4-Polytopes and 3-Spheres
نویسنده
چکیده
Steinitz (1906) gave a remarkably simple and explicit description of the set of all f -vectors f(P ) = (f0, f1, f2) of all 3-dimensional convex polytopes. His result also identifies the simple and the simplicial 3-dimensional polytopes as the only extreme cases. Moreover, it can be extended to strongly regular CW 2-spheres (topological objects), and further to Eulerian lattices of length 4 (combinatorial objects). The analogous problems “one dimension higher,” about the f -vectors and flag-vectors of 4-dimensional convex polytopes and their generalizations, are by far not solved, yet. However, the known facts already show that the answers will be much more complicated than for Steinitz’ problem. In this lecture, we will summarize the current state of knowledge. We will put forward two crucial parameters of fatness and complexity : Fatness F(P ) := f1+f2−20 f0+f3−10 is large if there are many more edges and 2-faces than there are vertices and facets, while complexity C(P ) := f03−20 f0+f3−10 is large if every facet has many vertices, and every vertex is in many facets. Recent results suggest that these parameters might allow one to differentiate between the cones of f or flag-vectors of • connected Eulerian lattices of length 5 (combinatorial objects), • strongly regular CW 3-spheres (topological objects), • convex 4-polytopes (discrete geometric objects), and • rational convex 4-polytopes (whose study involves arithmetic aspects). Further progress will depend on the derivation of tighter f -vector inequalities for convex 4-polytopes. On the other hand, we will need new construction methods that produce interesting polytopes which are far from being simplicial or simple — for example, very “fat” or “complex” 4-polytopes. In this direction, I will report about constructions (from joint work with Michael Joswig, David Eppstein and Greg Kuperberg) that yield • strongly regular CW 3-spheres of arbitrarily large fatness, • convex 4-polytopes of fatness larger than 5.048, and • rational convex 4-polytopes of fatness larger than 5− ε. 2000 Mathematics Subject Classification: 52B11, 52B10, 51M20
منابع مشابه
The E t-Construction for Lattices, Spheres and Polytopes
We describe and analyze a new construction that produces new Eulerian lattices from old ones. It specializes to a construction that produces new strongly regular cellular spheres (whose face lattices are Eulerian). The construction does not always specialize to convex polytopes; however, in a number of cases where we can realize it, it produces interesting classes of polytopes. Thus we produce ...
متن کاملEt-Construction for Lattices, Spheres and Polytopes
We describe and analyze a new construction that produces new Eulerian lattices from old ones. It specializes to a construction that produces new strongly regular cellular spheres (whose face lattices are Eulerian). The construction does not always specialize to convex polytopes; however, in a number of cases where we can realize it, it produces interesting classes of polytopes. Thus we produce ...
متن کاملNew polytopes from products
We construct a new 2-parameter family Emn, m, n ≥ 3, of self-dual 2-simple and 2-simplicial 4-polytopes, with flexible geometric realisations. E44 is the 24-cell. For large m, n the f -vectors have “fatness” close to 6. The Et-construction of Paffenholz and Ziegler applied to products of polygons yields cellular spheres with the combinatorial structure of Emn. Here we prove polytopality of thes...
متن کاملN ov 2 00 3 Many Triangulated 3 - Spheres Julian
We construct 2Ω(n 5/4) combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2O(n logn) combinatorial types of simplicial 4-polytopes, this proves that asymptotically, there are far more combinatorial types of triangulated 3-spheres than of simplicial 4-polytopes on n vertices. This complements results of Kalai (1988)...
متن کاملMany Triangulated 3-Spheres
We construct 2Ω(n 5/4) combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2O(n log n) combinatorial types of simplicial 4-polytopes, this proves that asymptotically, there are far more combinatorial types of triangulated 3-spheres than of simplicial 4-polytopes on n vertices. This complements results of Kalai (1988...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002